#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N=1e5+5;
int n,r,pool[N],wp[N],lstPointer;
bool regist[N];
long long ans;

int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	iostream::sync_with_stdio(false);
	cin.tie(0);

    cin>>n;
    for(int i=0;i<n;++i){
        cin>>r;
        ++pool[r];
        if(!regist[r]){
            regist[r]=true;
            wp[lstPointer++]=r;
        }
    }

    sort(wp,wp+lstPointer);

    for(int i=0;i<lstPointer-1;++i){
        // printf("[%d]:%d\n",wp[i],pool[wp[i]]);
        ans=max(
            0ll,
            ans+pool[wp[i]]-pool[wp[i+1]]
        );
        // printf("->%d\n",ans);
    }
    // printf("[%d]:%d\n",wp[lstPointer-1],pool[wp[lstPointer-1]]);
    ans+=pool[wp[lstPointer-1]];

    cout<<ans;


	return 0;
}